Approximate inference of functional dependencies from relations
نویسندگان
چکیده
منابع مشابه
Inferring Approximate Functional Dependencies from Example Data
This paper proposes a kind of PAC (Probably Approximately Correct) learning framework for inferring a set of functional dependencies. A simple algorithm for inferring the set of approximate functional dependencies from a subset of a full tuple set (i.e. a set of all tuples in the relation) is presented. It is shown that the upper bound of the sample complexity, which is the number of example tu...
متن کاملBottom-up Induction of Functional Dependencies from Relations
Data dependencies express the presence of structure in database relations, that can be utilised in the database design process. The discovery of data dependencies can be viewed as an induction process. Like in induction, we can distinguish between topdown approaches and bottom-up approaches. In top-down approach, dependencies are generated and then tested against the given relation. Since each ...
متن کاملAxiomatisation of Functional Dependencies in Incomplete Relations
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (FD). The rst type, called the strong FD (SFD), is satissed in an incomplete relation if for all possible worlds of this relation the FD is satissed in the standard way. The second type, called the weak FD (WFD), is satissed...
متن کاملApproximate Functional Dependencies for XML Data
Functional dependencies (FDs) are an integral part of database theory since they are used in integrity enforcement and in database design. Recently, functional dependencies satisfied by XML data (XFDs) have been introduced. In this work approximate functional dependencies that are XFDs approximately satisfied by a considerable part of the XML database are defined and the problem of inferring su...
متن کاملDiscovery of functional and approximate functional dependencies in relational databases
This study develops the foundation for a simple, yet efficient method for uncovering functional and approximate functional dependencies in relational databases. The technique is based upon the mathematical theory of partitions defined over a relation’s row identifiers. Using a levelwise algorithm the minimal non-trivial functional dependencies can be found using computations conducted on intege...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00028-u